منابع مشابه
Pascal-Brianchon Sets in Pappian Projective Planes Pascal-Brianchon Sets in Pappian Projective Planes
It is well-known that Pascal and Brianchon theorems characterize conics in a Pappian projective plane. But, using these theorems and their modifications we shall show that the notion of a conic (or better a Pascal-Brianchon set) can be defined without any use of theory of projectivities or of polarities as usually.
متن کاملParallel Sparse Modified Gram-Schmidt QR Decomposition
We present a parallel algorithm for the QR decomposition with column pivoting of a sparse matrix by means of Modiied Gram-Schmidt orthogonalization. Nonzero elements of the matrix M to decompose are stored in a one-dimensional doubly linked list data structure. A strategy to reduce ll-in is discussed to get memory savings and decrease the computation times. As an application of QR decomposition...
متن کاملWeighted sliding Empirical Mode Decomposition
The analysis of nonlinear and nonstationary time series is still a challenge, as most classical time series analysis techniques are restricted to data that is, at least, stationary. Empirical mode decomposition (EMD) in combination with a Hilbert spectral transform, together called Hilbert-Huang transform (HHT), alleviates this problem in a purely data-driven manner. EMD adaptively and locally ...
متن کاملMulti-relational Weighted Tensor Decomposition
In real-world network data, there often exist multiple types of relationships (edges) that we would like to model. For instance, in social networks, relationships between individuals may be personal, familial, or professional. In this paper, we examine a multi-relational learning scenario in which the learner is given a small set of training examples, sampled from the complete set of potential ...
متن کاملWeighted Majorization Algorithms for Weighted Least Squares Decomposition Models
For many least-squares decomposition models efficient algorithms are well known. A more difficult problem arises in decomposition models where each residual is weighted by a nonnegative value. A special case is principal components analysis with missing data. Kiers (1997) discusses an algorithm for minimizing weighted decomposition models by iterative majorization. In this paper, we propose a m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2006
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2006-017-x